Zur analytischen Lösung geometrischer Optimierungsaufgaben mittels Dualität bei Steuerungsproblemen. Teil I = Sur la résolution analytique d'un problème d'optimisation géométrique, utilisant la dualité, dans un problème de commande. Première partie = On analytical solution of geometrical optimization problem by duality for control problems. Part IANDREJEWA, J. A; KLÖTZLER, R.Zeitschrift für angewandte Mathematik und Mechanik. 1984, Vol 64, Num 1, pp 35-44, issn 0044-2267Article

Maximizing service of carousel storageKIM, Bara.Computers & operations research. 2005, Vol 32, Num 4, pp 767-772, issn 0305-0548, 6 p.Article

Optimal control problem for viscous Cahn-Hilliard equationXIAOPENG ZHAO; CHANGCHUN LIU.Nonlinear analysis. 2011, Vol 74, Num 17, pp 6348-6357, issn 0362-546X, 10 p.Article

Optimal control of the viscous weakly dispersive Degasperis-Procesi equationCHUNYU SHEN; GAO, Anna.Nonlinear analysis. 2010, Vol 72, Num 2, pp 933-945, issn 0362-546X, 13 p.Article

Cutting a country for smallest square fitVAN KREVELD, Marc; SPECKMANN, Bettina.Lecture notes in computer science. 2002, pp 91-102, issn 0302-9743, isbn 3-540-00142-5, 12 p.Conference Paper

Optimal solution of a Monge-Kantorovitch transportation problemABDELLAOUI, T.Journal of computational and applied mathematics. 1998, Vol 96, Num 2, pp 149-161, issn 0377-0427Article

Techniques de flots et comparaison d'images en 2D = Techniques from flow theory and 2D images comparisonDAOUD, M; MAHJOUB, A. R; TANGUY, M et al.Colloque sur le traitement du signal et des images. 1997, pp 853-856, 2VolConference Paper

An improved solution procedure for the n/l//max{γ_i(C_i)}→ΣC_i scheduling problemCHENG, T. C. E.The Journal of the Operational Research Society. 1991, Vol 42, Num 5, pp 413-417, issn 0160-5682Article

Choix de la distance optimale entre condensateurs à courant alternatif pour une batterieVARSHAVSKIJ, A. D.Èlektričestvo. 1988, Num 10, pp 51-57, issn 0013-5380Article

A Robust APTAS for the Classical Bin Packing ProblemEPSTEIN, Leah; LEVIN, Asaf.Lecture notes in computer science. 2006, pp 214-225, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

ACO algorithms with guaranteed convergence to the optimal solutionGUTJAHR, Walter J.Information processing letters. 2002, Vol 82, Num 3, pp 145-153, issn 0020-0190Article

Sensitivity analysis for knapsack problems : a negative resultBLAIR, C.Discrete applied mathematics. 1998, Vol 81, Num 1-3, pp 133-139, issn 0166-218XArticle

Statistics of partial minimaBEN-NAIM, E; HASTINGS, M. B; IZRAELEVITZ, D et al.Journal of physics. A, Mathematical and theoretical (Print). 2007, Vol 40, Num 47, issn 1751-8113, F1021-F1030Article

Warmbehandlung von Beton = Heat treatment of concreteMENZEL, U.Betonwerk und Fertigteil-Technik. 1991, Vol 57, Num 12, pp 92-97, issn 0373-4331Article

Sifting the margin: An iterative empirical classification schemeVANCE, Dan; RALESCU, Anca.Lecture notes in computer science. 2004, pp 191-200, issn 0302-9743, isbn 3-540-22817-9, 10 p.Conference Paper

Essential component and essential optimum solution of optimization problemsLUO, Q.Journal of optimization theory and applications. 1999, Vol 102, Num 2, pp 433-438, issn 0022-3239Article

Embedding grids into grids : Dilation four sufficesELLIS, J; MARKOV, M.Parallel processing letters. 1998, Vol 8, Num 2, pp 243-250, issn 0129-6264Conference Paper

On the metrics of Chaudhuri, Murthy and ChaudhuriRHODES, F.Pattern recognition. 1995, Vol 28, Num 5, pp 745-752, issn 0031-3203Article

The discrete p-maxian location problemERKUT, E; BAPTIE, T; VON HOHENBALKEN, B et al.Computers & operations research. 1989, Vol 17, Num 1, pp 51-61, issn 0305-0548, 11 p.Article

Problème de transport dynamique à retardsBLYUMIN, S. L; KOZLOV, P. A; MILOVIDOV, S. P et al.Avtomatika i telemehanika. 1984, Num 5, pp 158-161, issn 0005-2310Article

The Level Ancestor Problem simplifiedBENDER, Michael A; FARACH-COLTON, Martin.Theoretical computer science. 2004, Vol 321, Num 1, pp 5-12, issn 0304-3975, 8 p.Conference Paper

Random instance generation for MAX 3SATMOTOKI, Mitsuo.Lecture notes in computer science. 2001, pp 502-508, issn 0302-9743, isbn 3-540-42494-6Conference Paper

Constructing piecewise linear homeomorphisms of simple polygonsGUPTA, H; WENGER, R.Journal of algorithms (Print). 1997, Vol 22, Num 1, pp 142-157, issn 0196-6774Article

Iterative algorithm of reducing deminsionsXIONG FU-LIN; GUAN ZHI-NING.Dìqiú wùlixué bào. 1992, Vol 35, Num 2, pp 249-261, issn 0001-5733Article

Optimal comment due-date withlimited completion timeDICKMAN, B; WILAMOWSKY, Y; EPSTEIN, S et al.Computers & operations research. 1991, Vol 18, Num 1, pp 125-127, issn 0305-0548Article